Linear-Time Nearest Point Algorithms for Coxeter Lattices
نویسندگان
چکیده
منابع مشابه
Sublattices of Certain Coxeter Lattices
In this paper, we describe the sublattices of some lattices, extending previous results of [Ber]. Our description makes intensive use of graphs. Résumé. Dans cet article, nous décrivons les sous-réseaux de certains réseaux de Coxeter, prolongeant les résultats de [Ber]. Notre description utilise des graphes. In his 1951 paper Extreme forms ([Cox]), the late Coxeter studied lattices Λ which sati...
متن کاملExterior point algorithms for nearest points and convex quadratic programs
We consider the problem of finding the nearest point (by Euclidean distance) in a simplicial cone to a given point, and develop an exterior penalty algorithm for it. Each iteration in the algorithm consists of a single Newton step following a reduction in the value of the penalty parameter. Proofs of convergence of the algorithm are given. Various other versions of exterior penalty algorithms f...
متن کاملAlgorithms for Segmenting Time Series
As with most computer science problems, representation of the data is the key to ecient and eective solutions. Piecewise linear representation has been used for the representation of the data. This representation has been used by various researchers to support clustering, classication, indexing and association rule mining of time series data. A variety of algorithms have been proposed to obtain...
متن کاملw_0-Nearest Points and w_0-Farthest Point in Normed Linear Spaces
w0-Nearest Points and w0-Farthest Point in Normed Linear Spaces
متن کاملLinear time algorithms for Clobber
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimization problem on a set of words de ned by seven classes of forbidden patterns. We also prove that, playing on the cycle, it is always possible to remove at least 2n=3 pawns, and we give a conformation for which it is not...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2009.2039090